On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract)
نویسنده
چکیده
Abs t rac t . In this note a greedy algorithm is considered that computes a matching for a graph with a given ordering of its vertices, and those graphs are studied for which a vertex ordering exists such that the greedy algorithm always yields maximum cardinality matchings for each induced subgraph. We show that these graphs, called greedy matchable graphs, are a subclass of weakly triangulated graphs and contain strongly chordal graphs and chordal bipartite graphs as proper subclasses. The question when can this ordering be produced efficiently is discussed too.
منابع مشابه
AN EXACT PERFORMANCE BOUND FOR AN O(m+ n) TIME GREEDY MATCHING PROCEDURE
We prove an exact lower bound on γ(G), the size of the smallest matching that a certain O(m+ n) time greedy matching procedure may find for a given graph G with n vertices and m edges. The bound is precisely Erdös and Gallai’s extremal function that gives the size of the smallest maximum matching, over all graphs with n vertices and m edges. Thus the greedy procedure is optimal in the sense tha...
متن کاملAN EXACT PERFORMANCE BOUND FOR AN O ( m + n ) TIMEGREEDY MATCHING
We prove an exact lower bound on (G), the size of the smallest matching that a certain O(m + n) time greedy matching procedure may nd for a given graph G with n vertices and m edges. The bound is precisely Erdd os and Gallai's extremal function that gives the size of the smallest maximum matching, over all graphs with n vertices and m edges. Thus the greedy procedure is optimal in the sense tha...
متن کاملGreedy Online Matching on Random Graphs∗
In the online bipartite matching problem, vertices in one partition are given up front and vertices in the other partition arrive sequentially. When a vertex arrives, it reveals its neighboring edges and it must be immediately matched or left unmatched. We determine asymptotic matching sizes given by a variety of greedy online matching algorithms on random graphs. On G(n, n, p), we show that an...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملThe Computational Complexity of Weighted Greedy Matching
Motivated by the fact that in several cases a matching in a graph is stable if and only if it is produced by a greedy algorithm, we study the problem of computing a maximum weight greedy matching on weighted graphs, termed GREEDYMATCHING. In wide contrast to the maximum weight matching problem, for which many efficient algorithms are known, we prove that GREEDYMATCHING is strongly NP-hard and A...
متن کامل